package leetcode.lt100;

class Solution_62 {

	public static void main(String[] args) {
		uniquePaths(3, 2);
	}

	public static int uniquePaths(int m, int n) {

		int[][] dp = new int[m][n];

		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				if (i == 0 && j == 0)
					dp[0][0] = 1;
				if (i > 0)
					dp[i][j] += dp[i - 1][j];
				if (j > 0)
					dp[i][j] += dp[i][j - 1];
			}
		}

		return dp[m - 1][n - 1];

	}
}